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 20, 2026 05:34M-RochatM-RochatScore: 12,571Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 05:3412,552113,747,949101,858,0002,324,0002,113,536
2May 20, 2026 05:3412,560114,453,918102,207,0002,048,0002,113,536
3May 20, 2026 05:3412,560115,215,766101,913,0002,337,0002,113,536
4May 20, 2026 05:3412,566115,753,283101,949,0002,352,0002,113,536
5May 20, 2026 05:3412,571115,269,192101,987,0002,356,0002,113,536
6May 20, 2026 05:3412,640115,230,186102,903,0002,011,0002,113,536
7May 20, 2026 05:3412,652114,665,507102,943,0002,070,0002,113,536
8May 20, 2026 05:3412,666117,150,503103,076,0002,054,0002,113,536
9May 20, 2026 05:3412,682117,430,521103,136,0002,128,0002,113,536