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 listAug 10, 2026 16:47Victor MerckléVictor MerckléScore: 4,210Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 16:494,16542,859,12633,457,0001,115,0002,117,632stderr
2Aug 10, 2026 16:494,17342,940,26033,510,0001,134,0002,117,632stderr
3Aug 10, 2026 16:494,18242,910,47933,625,0001,086,0002,117,632stderr
4Aug 10, 2026 16:494,20943,140,57033,819,0001,119,0002,117,632stderr
5Aug 10, 2026 16:494,21043,241,40333,832,0001,112,0002,117,632stderr
6Aug 10, 2026 16:494,21743,242,23633,949,0001,057,0002,117,632stderr
7Aug 10, 2026 16:494,24043,628,72634,171,0001,026,0002,117,632stderr
8Aug 10, 2026 16:494,26043,562,42834,296,0001,062,0002,117,632stderr
9Aug 10, 2026 16:494,32544,127,61734,799,0001,105,0002,117,632stderr