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 13:55wnwnScore: 7,101Success
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 13:556,27075,512,24051,039,0001,000,0002,510,848
2Feb 18, 2026 13:556,31079,897,05651,367,0001,007,0002,523,136
3Feb 18, 2026 13:556,34574,420,60349,622,0003,038,0002,478,080
4Feb 18, 2026 13:557,10185,103,76957,937,000998,0002,416,640
5Feb 18, 2026 13:557,24179,974,89758,094,0002,003,0002,469,888
6Feb 18, 2026 13:557,37680,607,77860,219,0001,003,0002,428,928