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 listJun 27, 2026 15:02Daniel MastalerzDaniel MastalerzError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 15:06045,222,46634,592,0001,036,0002,113,536expected "53687551088193167 ", got "53687551088167567"
2Jun 27, 2026 15:064,26844,886,72834,404,0001,025,0002,113,536
3Jun 27, 2026 15:064,28845,071,78934,544,0001,054,0002,113,536
4Jun 27, 2026 15:064,29645,153,82234,601,0001,063,0002,113,536
5Jun 27, 2026 15:064,29945,269,59734,638,0001,046,0002,113,536
6Jun 27, 2026 15:064,30245,158,03334,648,0001,059,0002,113,536
7Jun 27, 2026 15:064,31045,309,63434,736,0001,043,0002,113,536
8Jun 27, 2026 15:064,31345,281,66234,748,0001,051,0002,113,536
9Jun 27, 2026 15:064,42955,797,04435,642,0001,121,0002,113,536