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 listAug 7, 2026 13:46TonyTonyScore: 7,644Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 7, 2026 13:467,59572,834,07860,927,0002,116,0002,113,536
2Aug 7, 2026 13:467,62273,082,57461,073,0002,192,0002,113,536
3Aug 7, 2026 13:467,62973,208,92961,139,0002,183,0002,113,536
4Aug 7, 2026 13:467,63773,125,04661,138,0002,250,0002,113,536
5Aug 7, 2026 13:467,64473,228,85961,206,0002,242,0002,113,536
6Aug 7, 2026 13:467,65073,373,85961,285,0002,216,0002,113,536
7Aug 7, 2026 13:467,66773,482,85961,368,0002,270,0002,113,536
8Aug 7, 2026 13:467,67773,590,05961,539,0002,188,0002,113,536
9Aug 7, 2026 13:467,79574,469,81462,448,0002,256,0002,113,536