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 listJan 31, 2026 11:52olliecrowolliecrowScore: 8,165Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2026 11:526,75883,081,81748,078,0008,013,0002,408,448
2Jan 31, 2026 11:526,80987,684,16049,574,0006,940,0002,392,064
3Jan 31, 2026 11:526,88184,143,84550,096,0007,013,0002,506,752
4Jan 31, 2026 11:528,16592,814,45860,794,0006,976,0002,306,048
5Jan 31, 2026 11:528,17498,729,64358,868,0008,979,0002,445,312
6Jan 31, 2026 11:528,25394,272,40058,574,0009,927,0002,449,408