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 listMar 14, 2026 19:11wnwnScore: 4,281Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 19:114,25858,574,97534,330,0001,009,0002,273,280
2Mar 14, 2026 19:114,25859,126,15334,335,0001,009,0002,486,272
3Mar 14, 2026 19:114,26061,046,86234,348,0001,010,0002,273,280
4Mar 14, 2026 19:114,26460,432,51834,384,0001,011,0002,494,464
5Mar 14, 2026 19:114,28160,116,09334,514,0001,015,0002,502,656
6Mar 14, 2026 19:114,28761,930,64334,565,0001,016,0002,273,280
7Mar 14, 2026 19:114,28861,825,37334,575,0001,016,0002,494,464
8Mar 14, 2026 19:114,32158,896,38833,874,0001,992,0002,502,656
9Mar 14, 2026 19:114,33157,343,59733,953,0001,997,0002,273,280