Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listApr 11, 2026 13:23wnwnScore: 4,750Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 11, 2026 13:234,72966,003,67537,238,0002,012,0002,277,376
2Apr 11, 2026 13:234,75065,513,17738,416,0001,010,0002,277,376
3Apr 11, 2026 13:234,75365,580,66638,439,0001,011,0002,277,376