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 listAug 27, 2026 02:01Victor MerckléVictor MerckléScore: 3,851Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 02:023,83440,233,76830,546,0001,279,0002,113,536
2Aug 27, 2026 02:023,83940,272,13530,656,0001,211,0002,113,536
3Aug 27, 2026 02:023,84040,258,33830,834,0001,044,0002,113,536
4Aug 27, 2026 02:023,84740,278,75230,675,0001,256,0002,113,536
5Aug 27, 2026 02:023,85140,310,82730,685,0001,285,0002,113,536
6Aug 27, 2026 02:023,85940,388,26230,769,0001,267,0002,113,536
7Aug 27, 2026 02:023,87640,579,60030,911,0001,263,0002,113,536
8Aug 27, 2026 02:023,89540,668,76731,081,0001,252,0002,113,536
9Aug 27, 2026 02:024,00442,185,95532,025,0001,210,0002,113,536