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 18, 2026 02:37Elijah KinElijah KinScore: 51,313Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 02:3751,149449,209,017421,537,0002,996,0002,260,992
2Mar 18, 2026 02:3751,167453,811,338419,690,0004,996,0002,375,680
3Mar 18, 2026 02:3751,216448,478,953423,091,0002,000,0002,338,816
4Mar 18, 2026 02:3751,237458,728,178422,277,0002,994,0002,269,184
5Mar 18, 2026 02:3751,313450,120,793424,896,000999,0002,273,280
6Mar 18, 2026 02:3751,424449,815,829424,819,0001,999,0002,273,280
7Mar 18, 2026 02:3751,449449,900,520425,024,0002,000,0002,273,280
8Mar 18, 2026 02:3751,450452,850,872426,037,0001,000,0002,273,280
9Mar 18, 2026 02:3751,473454,849,959425,226,0002,001,0002,273,280