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 listSep 2, 2026 18:22CheckHarryCheckHarryScore: 6,049Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 18:226,03059,863,95348,872,0001,180,0002,113,536
2Sep 2, 2026 18:226,04060,016,43948,953,0001,180,0002,113,536
3Sep 2, 2026 18:226,04259,985,40748,976,0001,175,0002,113,536
4Sep 2, 2026 18:226,04460,008,08249,165,0001,008,0002,113,536
5Sep 2, 2026 18:226,04960,064,83549,043,0001,164,0002,113,536
6Sep 2, 2026 18:226,05760,160,26749,268,0001,008,0002,113,536
7Sep 2, 2026 18:226,06363,229,11949,252,0001,079,0002,113,536
8Sep 2, 2026 18:226,07960,418,45749,296,0001,161,0002,113,536
9Sep 2, 2026 18:226,10060,407,72949,518,0001,112,0002,113,536