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 27, 2026 02:17Victor MerckléVictor MerckléScore: 3,773Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 02:183,75139,438,05829,916,0001,219,0002,117,632stderr
2Aug 27, 2026 02:183,75939,963,42230,082,0001,124,0002,117,632stderr
3Aug 27, 2026 02:183,76939,612,98630,106,0001,179,0002,117,632stderr
4Aug 27, 2026 02:183,76939,558,33930,181,0001,102,0002,117,632stderr
5Aug 27, 2026 02:183,77340,858,85030,191,0001,129,0002,117,632stderr
6Aug 27, 2026 02:183,78439,691,16030,296,0001,113,0002,117,632stderr
7Aug 27, 2026 02:183,78839,680,20730,317,0001,128,0002,117,632stderr
8Aug 27, 2026 02:183,80439,936,50030,446,0001,135,0002,117,632stderr
9Aug 27, 2026 02:183,80639,904,50430,574,0001,023,0002,117,632stderr