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 listApr 26, 2026 13:58wnwnScore: 3,592Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 13:583,40544,652,81127,258,0001,009,0002,490,368
2Apr 26, 2026 13:583,41142,571,89927,305,0001,011,0002,482,176
3Apr 26, 2026 13:583,44545,564,28627,579,0001,021,0002,486,272
4Apr 26, 2026 13:583,53142,668,79928,303,0001,010,0002,486,272
5Apr 26, 2026 13:583,59244,115,89027,829,0001,987,0002,486,272
6Apr 26, 2026 13:583,60949,981,25127,963,0001,997,0002,494,464
7Apr 26, 2026 13:583,79847,820,59330,511,0001,017,0002,482,176
8Apr 26, 2026 13:584,01349,406,07433,312,00002,482,176
9Apr 26, 2026 13:584,07845,059,78032,825,0001,025,0002,293,760