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 13, 2026 09:18Dominique GarmierDominique GarmierScore: 77,957Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 09:1877,827669,119,895588,964,00056,996,0002,269,184
2Mar 13, 2026 09:1877,832667,631,561589,004,00057,000,0002,269,184
3Mar 13, 2026 09:1877,920669,202,738589,759,00056,976,0002,412,544
4Mar 13, 2026 09:1877,924670,531,477586,789,00059,978,0002,273,280
5Mar 13, 2026 09:1877,957675,892,435585,037,00062,003,0002,273,280
6Mar 13, 2026 09:1877,985677,944,413589,252,00058,024,0002,273,280
7Mar 13, 2026 09:1877,997680,352,670586,337,00061,035,0002,273,280
8Mar 13, 2026 09:1878,042670,473,740583,773,00063,975,0002,273,280
9Mar 13, 2026 09:1878,055669,974,364587,871,00059,986,0002,412,544