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 21, 2026 13:57Victor MerckléVictor MerckléScore: 4,665Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 13:584,64446,350,86237,479,0001,073,0002,113,536
2May 21, 2026 13:584,65646,502,65337,574,0001,074,0002,113,536
3May 21, 2026 13:584,65746,503,30137,601,0001,058,0002,113,536
4May 21, 2026 13:584,66347,948,43337,637,0001,067,0002,113,536
5May 21, 2026 13:584,66546,583,14337,623,0001,102,0002,113,536
6May 21, 2026 13:584,66747,277,35337,638,0001,102,0002,113,536
7May 21, 2026 13:584,67046,618,98037,699,0001,066,0002,113,536
8May 21, 2026 13:584,67047,464,35937,742,0001,025,0002,113,536
9May 21, 2026 13:584,67846,773,12937,825,0001,007,0002,113,536