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 listFeb 19, 2026 00:39Josu San MartinJosu San MartinScore: 6,302Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 00:395,96170,649,42248,468,0001,009,0002,502,656
2Feb 19, 2026 00:396,17279,817,50849,220,0002,008,0002,322,432
3Feb 19, 2026 00:396,24377,991,24749,827,0001,993,0002,310,144
4Feb 19, 2026 00:396,30274,601,47147,278,0005,029,0002,269,184
5Feb 19, 2026 00:396,40179,773,84451,122,0002,004,0002,486,272
6Feb 19, 2026 00:396,43078,837,75452,365,0001,007,0002,269,184