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 29, 2026 01:58zielajzielajScore: 3,560Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 01:583,45055,700,47127,614,0001,022,0002,519,040
2Mar 29, 2026 02:003,45752,984,25827,666,0001,024,0002,519,040
3Mar 29, 2026 02:013,47253,311,91226,827,0001,987,0002,441,216
4Mar 29, 2026 01:573,47958,570,90826,887,0001,991,0002,433,024
5Mar 29, 2026 02:003,55455,420,66128,483,0001,017,0002,519,040
6Mar 29, 2026 02:013,55551,911,77228,488,0001,017,0002,519,040
7Mar 29, 2026 02:013,56052,630,02228,530,0001,018,0002,433,024
8Mar 29, 2026 01:573,57558,943,88028,653,0001,023,0002,519,040
9Mar 29, 2026 01:573,59353,033,57628,791,0001,028,0002,437,120
10Mar 29, 2026 01:583,59556,840,40127,852,0001,989,0002,523,136
11Mar 29, 2026 02:003,59558,184,30627,846,0001,989,0002,437,120
12Mar 29, 2026 01:583,59655,488,66428,850,000994,0002,486,272