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 listDec 5, 2025 10:12Alexander RuliovAlexander RuliovScore: 455,466Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 5, 2025 10:12402,7353,363,784,0173,272,727,00069,972,0002,289,664
2Dec 5, 2025 10:12408,0173,415,921,9813,326,568,00059,974,0002,285,568
3Dec 5, 2025 10:12454,5593,806,040,2833,704,861,00067,979,0002,285,568
4Dec 5, 2025 10:12455,1453,809,239,5133,712,730,00064,977,0002,281,472
5Dec 5, 2025 10:12455,4663,808,382,6413,723,392,00056,975,0002,281,472
6Dec 5, 2025 10:12455,8563,811,899,3703,725,644,00057,963,0002,285,568
7Dec 5, 2025 10:12457,9653,824,453,2423,740,142,00060,969,0002,363,392
8Dec 5, 2025 10:12459,4353,844,025,9963,748,339,00064,971,0002,281,472
9Dec 5, 2025 10:12466,8683,902,053,3993,810,041,00064,966,0002,453,504