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 listMar 24, 2025 14:56Foo Chuan Le, NicholasFoo Chuan Le, NicholasScore: 1,828,208Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2025 14:561,826,77815,200,870,69915,095,293,00066,965,0002,277,376
2Mar 24, 2025 14:561,826,84715,196,672,03015,095,854,00066,972,0002,289,664
3Mar 24, 2025 14:561,827,01815,203,054,00015,098,277,00065,970,0002,277,376
4Mar 24, 2025 14:561,827,67615,203,199,51215,103,739,00065,972,0002,289,664
5Mar 24, 2025 14:561,828,20815,204,548,54915,105,157,00068,973,0002,277,376
6Mar 24, 2025 14:561,828,27915,212,002,16515,109,739,00064,973,0002,277,376
7Mar 24, 2025 14:561,828,28415,206,513,18815,109,787,00064,968,0002,281,472
8Mar 24, 2025 14:561,829,54715,217,938,75215,120,272,00064,971,0002,289,664
9Mar 24, 2025 14:561,829,91915,220,726,17415,115,357,00072,967,0002,289,664