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:24M-RochatM-RochatScore: 20,447Success
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:2420,137184,719,488165,970,0001,175,0002,469,888
2May 5, 2026 16:2420,263184,596,487167,019,0001,168,0002,457,600
3May 5, 2026 16:2420,362186,324,111167,803,0001,202,0002,453,504
4May 5, 2026 16:2420,430183,006,706168,563,0001,008,0002,473,984
5May 5, 2026 16:2420,447188,426,168168,532,0001,180,0002,473,984
6May 5, 2026 16:2420,461187,372,041168,631,0001,196,0002,473,984
7May 5, 2026 16:2420,588187,635,669169,701,0001,182,0002,461,696
8May 5, 2026 16:2420,599188,286,479169,869,0001,109,0002,465,792
9May 5, 2026 16:2420,841188,731,815169,787,0003,200,0002,473,984