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 listSep 2, 2026 10:59CheckHarryCheckHarryError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 11:020327,709,134316,805,0001,003,0002,113,536expected "53690845176056910 ", got "27216130438982659 "
2Sep 2, 2026 11:020323,802,895313,040,0001,005,0002,113,536expected "53695224084968831 ", got "27223778885485089 "
3Sep 2, 2026 11:020327,931,301316,968,0001,003,0002,113,536expected "53682463568628711 ", got "27211336899762521 "