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 listJul 19, 2026 01:21Ondřej PolaneckýOndřej PolaneckýScore: 6,437Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2026 01:216,42962,988,75752,349,0001,018,0002,113,536
2Jul 19, 2026 01:216,42962,974,63652,213,0001,155,0002,113,536
3Jul 19, 2026 01:216,43262,953,68452,341,0001,045,0002,113,536
4Jul 19, 2026 01:216,43562,963,14052,247,0001,166,0002,113,536
5Jul 19, 2026 01:216,43763,090,59552,259,0001,173,0002,113,536
6Jul 19, 2026 01:216,44563,138,67952,454,0001,043,0002,113,536
7Jul 19, 2026 01:216,45663,229,32852,545,0001,040,0002,113,536
8Jul 19, 2026 01:216,46064,130,46652,458,0001,163,0002,113,536
9Jul 19, 2026 01:216,46063,124,56052,583,0001,040,0002,113,536