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 listMay 5, 2026 16:02M-RochatM-RochatScore: 24,924Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 16:1124,840224,717,431205,042,0001,138,0002,473,984
2May 5, 2026 16:1124,871224,462,201205,295,0001,136,0002,473,984
3May 5, 2026 16:1124,904224,428,958205,542,0001,163,0002,469,888
4May 5, 2026 16:1124,908220,941,170205,553,0001,184,0002,469,888
5May 5, 2026 16:1124,924221,826,858205,741,0001,130,0002,469,888
6May 5, 2026 16:1124,943226,136,793205,837,0001,195,0002,461,696
7May 5, 2026 16:1124,979225,268,306206,151,0001,179,0002,473,984
8May 5, 2026 16:1124,996225,493,306206,312,0001,162,0002,473,984
9May 5, 2026 16:1125,077224,996,216206,988,0001,156,0002,465,792