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 18, 2026 03:31wnwnScore: 8,253Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 03:318,20089,842,18266,061,0002,001,0002,289,664
2Apr 18, 2026 03:318,20388,488,74966,079,0002,002,0002,265,088
3Apr 18, 2026 03:318,20689,194,06766,104,0002,003,0002,273,280
4Apr 18, 2026 03:318,22187,174,54267,233,0001,003,0002,371,584
5Apr 18, 2026 03:318,25392,443,70567,492,0001,007,0002,293,760
6Apr 18, 2026 03:318,29092,709,84967,812,000997,0002,289,664
7Apr 18, 2026 03:318,35495,518,72468,334,0001,004,0002,293,760
8Apr 18, 2026 03:318,40193,100,85867,739,0001,992,0002,269,184
9Apr 18, 2026 03:319,102105,675,23074,537,0001,007,0002,265,088