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 12, 2026 06:04Victor MerckléVictor MerckléScore: 4,238Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 06:054,19944,726,91933,721,0001,137,0002,117,632stderr
2Aug 12, 2026 06:054,20243,073,11333,748,0001,129,0002,117,632stderr
3Aug 12, 2026 06:054,21143,168,16233,834,0001,118,0002,117,632stderr
4Aug 12, 2026 06:054,22443,231,86833,924,0001,138,0002,117,632stderr
5Aug 12, 2026 06:054,23843,312,59534,108,0001,075,0002,117,632stderr
6Aug 12, 2026 06:054,23943,396,53133,938,0001,247,0002,117,632stderr
7Aug 12, 2026 06:054,26343,757,57134,324,0001,061,0002,117,632stderr
8Aug 12, 2026 06:054,27643,715,01634,339,0001,153,0002,117,632stderr
9Aug 12, 2026 06:054,31744,251,08434,718,0001,121,0002,117,632stderr