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 16, 2026 19:14marko1597marko1597Score: 4,691Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 19:234,64646,885,03837,533,0001,031,0002,117,632
2Aug 16, 2026 19:234,64848,155,82537,459,0001,121,0002,117,632
3Aug 16, 2026 19:234,67447,233,52537,766,0001,030,0002,117,632
4Aug 16, 2026 19:234,68447,294,42637,745,0001,137,0002,117,632
5Aug 16, 2026 19:234,69147,272,72037,892,0001,047,0002,117,632
6Aug 16, 2026 19:234,69247,304,86837,913,0001,031,0002,117,632
7Aug 16, 2026 19:234,69947,381,63637,880,0001,124,0002,117,632
8Aug 16, 2026 19:234,70447,481,74437,938,0001,109,0002,117,632
9Aug 16, 2026 19:234,74947,735,91538,307,0001,116,0002,117,632