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:53TonyTonyScore: 7,554Success
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:537,51372,168,20860,137,0002,223,0002,113,536
2Aug 7, 2026 13:537,51872,175,17060,269,0002,138,0002,113,536
3Aug 7, 2026 13:537,52072,213,19560,190,0002,230,0002,113,536
4Aug 7, 2026 13:537,54572,353,60060,370,0002,261,0002,113,536
5Aug 7, 2026 13:537,55472,454,61460,487,0002,218,0002,113,536
6Aug 7, 2026 13:537,55672,493,80060,460,0002,256,0002,113,536
7Aug 7, 2026 13:537,57772,615,07560,650,0002,244,0002,113,536
8Aug 7, 2026 13:537,57772,584,80460,669,0002,225,0002,113,536
9Aug 7, 2026 13:537,57872,731,67560,704,0002,200,0002,113,536