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 27, 2026 05:52Victor MerckléVictor MerckléScore: 4,086Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 05:534,05641,982,51832,570,0001,103,0002,117,632stderr
2Aug 27, 2026 05:534,05742,012,41332,588,0001,089,0002,117,632stderr
3Aug 27, 2026 05:534,06242,074,63232,619,0001,101,0002,117,632stderr
4Aug 27, 2026 05:534,06542,104,23532,609,0001,136,0002,117,632stderr
5Aug 27, 2026 05:534,08642,333,21232,808,0001,112,0002,117,632stderr
6Aug 27, 2026 05:534,15242,757,56633,296,0001,172,0002,117,632stderr
7Aug 27, 2026 05:534,16342,925,23333,406,0001,151,0002,117,632stderr
8Aug 27, 2026 05:534,24750,484,65334,148,0001,103,0002,117,632stderr
9Aug 27, 2026 05:534,38245,411,76735,237,0001,141,0002,117,632stderr