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 18, 2026 10:02wnwnScore: 7,258Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 10:026,19173,872,26548,361,0003,022,0002,375,680
2Feb 18, 2026 10:026,30381,283,87049,296,0003,018,0002,301,952
3Feb 18, 2026 10:026,41279,178,83451,210,0002,008,0002,387,968
4Feb 18, 2026 10:027,25882,210,59857,230,0003,012,0002,359,296
5Feb 18, 2026 10:027,27683,492,82756,367,0004,026,0002,437,120
6Feb 18, 2026 10:027,35885,539,11158,069,0003,003,0002,482,176