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 31, 2026 04:05Josu San MartinJosu San MartinScore: 7,852Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 04:097,78973,053,64363,633,0001,022,0002,113,536
2Aug 31, 2026 04:097,79074,335,91463,416,0001,246,0002,113,536
3Aug 31, 2026 04:097,80373,261,20263,670,0001,100,0002,113,536
4Aug 31, 2026 04:097,81373,230,53863,729,0001,120,0002,113,536
5Aug 31, 2026 04:097,85273,651,26864,023,0001,150,0002,113,536
6Aug 31, 2026 04:097,86573,709,20964,166,0001,119,0002,113,536
7Aug 31, 2026 04:097,90274,094,58764,571,0001,021,0002,113,536
8Aug 31, 2026 04:097,96474,649,06264,902,0001,202,0002,113,536
9Aug 31, 2026 04:098,19376,467,17566,914,0001,090,0002,113,536