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 listMar 18, 2026 04:09zielajzielajScore: 3,529Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 04:093,47853,796,59726,880,0001,991,0002,437,120
2Mar 18, 2026 04:093,50956,093,87627,119,0002,008,0002,531,328
3Mar 18, 2026 04:093,52051,114,53327,198,0002,014,0002,445,312
4Mar 18, 2026 04:093,52950,423,97327,272,0002,020,0002,519,040
5Mar 18, 2026 04:093,52954,448,37227,273,0002,020,0002,445,312
6Mar 18, 2026 04:093,53549,872,65828,330,0001,011,0002,433,024