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 12, 2026 12:19wnwnScore: 4,223Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2026 12:194,20363,199,51832,891,0001,993,0002,277,376
2Apr 12, 2026 12:194,22358,352,89633,049,0002,002,0002,277,376
3Apr 12, 2026 12:194,25955,878,53933,331,0002,020,0002,277,376