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 listFeb 18, 2026 22:52wnwnScore: 5,547Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 22:525,43169,680,91244,074,0001,001,0002,269,184
2Feb 18, 2026 22:525,46372,235,86245,339,00002,531,328
3Feb 18, 2026 22:525,53067,672,64443,904,0001,995,0002,539,520
4Feb 18, 2026 22:525,54765,208,56743,040,0003,002,0002,433,024
5Feb 18, 2026 22:525,58466,160,49446,347,00002,277,376
6Feb 18, 2026 22:525,59168,088,67546,402,00002,273,280