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 listApr 24, 2026 14:40TudyMTudyMScore: 49,783Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 14:4049,723429,798,374409,709,0002,997,0002,461,696
2Apr 24, 2026 14:4049,735427,610,093410,803,0001,999,0002,453,504
3Apr 24, 2026 14:4049,766434,936,559411,059,0002,000,0002,457,600
4Apr 24, 2026 14:4049,768435,339,543411,076,0002,000,0002,465,792
5Apr 24, 2026 14:4049,783428,465,548412,203,0001,002,0002,469,888
6Apr 24, 2026 14:4049,816430,959,189409,479,0003,994,0002,408,448
7Apr 24, 2026 14:4049,825435,334,205409,554,0003,995,0002,453,504
8Apr 24, 2026 14:4049,827433,129,784410,570,0002,996,0002,469,888
9Apr 24, 2026 14:4049,863433,735,886409,872,0003,998,0002,465,792