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 listJan 5, 2026 20:49lipapipalipapipaScore: 68,889Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 20:4968,643595,446,041504,768,00064,970,000303,104
2Jan 5, 2026 20:4968,726598,914,351501,498,00068,931,000176,128
3Jan 5, 2026 20:4968,729599,775,892504,514,00065,936,0002,273,280
4Jan 5, 2026 20:4968,752599,663,528506,684,00063,960,000307,200
5Jan 5, 2026 20:4968,889600,338,121506,807,00064,975,000176,128
6Jan 5, 2026 20:4969,018600,008,881516,867,00055,985,000294,912
7Jan 5, 2026 20:4969,023601,055,359506,018,00066,870,000176,128
8Jan 5, 2026 20:4971,248618,658,767518,440,00072,921,000176,128
9Jan 5, 2026 20:4971,430617,944,671521,008,00071,863,000307,200