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 29, 2026 16:56Victor MerckléVictor MerckléScore: 3,683Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 16:593,64839,866,85929,210,0001,073,0002,117,632stderr
2Aug 29, 2026 16:593,65038,717,21629,191,0001,108,0002,117,632stderr
3Aug 29, 2026 16:593,66138,786,23529,271,0001,122,0002,117,632stderr
4Aug 29, 2026 16:593,67339,556,70329,366,0001,127,0002,117,632stderr
5Aug 29, 2026 16:593,68338,925,93229,411,0001,158,0002,117,632stderr
6Aug 29, 2026 16:593,69038,974,17629,513,0001,121,0002,117,632stderr
7Aug 29, 2026 16:593,69139,017,31829,518,0001,122,0002,117,632stderr
8Aug 29, 2026 16:593,72639,300,69829,803,0001,131,0002,117,632stderr
9Aug 29, 2026 16:593,85147,625,92630,763,0001,201,0002,117,632stderr